Project-Team:DYOGENE

Project-Team Dyogene

Members

Overall Objectives

Research Program

Network Calculus
Perfect Simulation
Stochastic Geometry
Information Theory
The Cavity Method for Network Algorithms
Statistical Learning

Application Domains

Wireless Networks
Embedded Networks
Distributed Content Delivery Networks
Probabilistic Algorithms for Renewable Integration in Smart grid
Algorithms for finding communities

Highlights of the Year

New Software and Platforms

CloNES

New Results

Evaluation and optimization of the quality of service perceived by mobile users for new services in cellular networks
Interference and SINR coverage in spatial non-slotted Aloha networks
Random linear multihop relaying in a general field of interferers using spatial Aloha
Studying the SINR process of the typical user in Poisson networks by using its factorial moment measures
Performance laws of large heterogeneous cellular networks
Wireless networks appear Poissonian due to strong shadowing
What frequency bandwidth to run cellular network in a given country? - a downlink dimensioning problem
Optimal Geographic Caching In Cellular Networks
Spatial distribution of the SINR in Poisson cellular networks with sector antennas
Theoretical expression of link performance in OFDM cellular networks with MIMO compared to simulation and measurements
Information Theory: Boolean model in the Shannon Regime
Stochastic Geometry: Wireless Modeling
Information Theory: SIMO
Theory of point processes
Cross-Technology Interference Mitigation in Body Area Networks: An Optimization Approach
Body-to-Body Area Networks
Exact Worst-Case Delay in FIFO-Multiplexing Feed-Forward Networks
Fast symbolic computation of the worst-case delay in tandem networks and applications
Ancillary Service to the Grid Using Intelligent Deferrable Loads
Spectral Decomposition of Demand-Side Flexibility for Reliable Ancillary Services in a Smart Grid
State Estimation for the Individual and the Population in Mean Field Control with Application to Demand Dispatch
Perfect sampling of Jackson queueing networks
Speeding up Glauber Dynamics for Random Generation of Independent Sets
Approximate optimality with bounded regret in dynamic matching models
Perfect sampling for multiclass closed queueing networks
Fast and Memory Optimal Low-Rank Matrix Approximation
Combinatorial Bandits Revisited
Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs
Designing Adaptive Replication Schemes in Distributed Content Delivery Networks
Spectral Detection in the Censored Block Model
A spectral method for community detection in moderately-sparse degree-corrected stochastic block models
An Impossibility Result for Reconstruction in a Degree-Corrected Planted-Partition Model
Universality in polytope phase transitions and message passing algorithms
Contagions in Random Networks with Overlapping Communities
The Diameter of Weighted Random Graphs.

Bilateral Contracts and Grants with Industry

CRE with Orange
MSR-Inria Joint Lab

Partnerships and Cooperations

National Initiatives
International Initiatives
International Research Visitors

Dissemination

Promoting Scientific Activities
Teaching - Supervision - Juries

Bibliography

Publications of the year
References in notes

Inria | Raweb 2015 | Presentation of the Project-Team DYOGENE | DYOGENE Web Site


	PDF	e-Pub

Previous |

Home | Next next

Section: New Results

The Diameter of Weighted Random Graphs.

In [3] , we study the impact of random exponential edge weights on the distances in a random graph and, in particular, on its diameter. Our main result consists of a precise asymptotic expression for the maximal weight of the shortest weight paths between all vertices (the weighted diameter) of sparse random graphs, when the edge weights are i.i.d. exponential random variables.

Previous |

Home | Next next